Ulysses: a robust, low-diameter, low-latency peer-to-peer network

Ulysses: A Robust, Low-Diameter, Low-Latency Peer-to-Peer Network

A number of Distributed Hash Table (DHT)-based protocols have been proposed to address the issue of scalability in peer-topeer networks. However, it remains an open question whether there exists a DHT scheme that can achieve the theoretical lower bound of on network diameter when the average routing table size at nodes is no more than . In this paper, we present Ulysses, a peer-to-peer network ...

Ulysses: A Robust, Low-Diameter, Low-Latency Peer-ti-Peer Network

A number of Distributed Hash Table (DHT)-based protocols have been proposed to address the issue of scalability in peer-topeer networks. However, it remains an open question whether there exists a DHT scheme that can achieve the theoretical lower bound of on network diameter when the average routing table size at nodes is no more than . In this paper, we present Ulysses, a peer-to-peer network ...

Ulysses: A Robust, Low-Diameter, Low-Laten y Peer-to-Peer Network

Building low-diameter peer-to-peer networks

Peer-to-Peer (P2P) computing has emerged as a significant paradigm for providing distributed services, in particular search and data sharing. Current P2P networks (e.g., Gnutella) are constructed by participants following their own uncoordinated (and often whimsical) protocols; they consequently suffer from frequent network overload and partitioning into disconnected pieces separated by choke p...

Building resilient low-diameter peer-to-peer topologies

As more applications rely on underlying peer-to-peer topologies, the need for efficient and resilient infrastructure has become more pressing. A number of important classes of topologies have emerged over the last several years, all with various strengths and weaknesses. For example, the popular structured peer-to-peer topologies based on Distributed Hash Tables (DHTs) offer applications assure...